Date: Tue, 10 Dec 1996 16:52:02 GMT
Server: NCSA/1.4.2
Content-type: text/html

<HTML>
<head>
<title>CSE 321 Assignment #3</title>
</head>
<body>
<h1>CSE 321 Assignment #3<br>Autumn 1996</h1>
<h3>Due: Friday, October 18, 1996.
<br>

</h3>
<p>
Reading Assignment: Read sections 3.1 and 3.2 of the text and skim the
supplementary logic notes.
The following problems are from the Third Edition of the text.
 
<p>
Practice Problems: page 181, Problem 9; page 182, Problem 15
<p> Problems: 
<ol>
<p><li> page 181, Problem 8.  Instead of part (b), give an indirect proof of
the following: "If n squared is odd then so is n."
<p><li> page 181, Problem 10
<p><li> Prove or disprove that n*n + n + 1 is always prime.
<p><li> Prove that the square of an integer not divisible by 6 leaves a
remainder of 1, 3 or 4 when divided by 6.  (Hint:  Use a proof by cases,
one case per possible remainder when the integer is divided by 6.)
<p><li> page 182, Problem 24
<p><li> page 182, Problem 40
<p><li> page 182, Problem 44
<p><li> (Bonus) page 182, Problem 32
<p><li> (Bonus) page 182, Problem 36
<p><li> (Bonus) Prove that any prime number bigger than 3 leaves
remainder of 1 or 5 when divided by 6.  
</ol>
</body>
</html>
